A New Affine Invariant Fitting Algorithm for Algebraic Curves
نویسندگان
چکیده
In this paper, we preseni a new affine invariant curve fitting technique. Our method is based on the affine invariant Fourler descrlptors and implicitization of them by matrix annihilation. Experlmental results are presented to assess the stability and robustness of our fitting method under data perturba'tions.
منابع مشابه
Affine Invariant 3L Fitting of Implicit Polynomials
Combining implicit polynomials and algebraic invariants for representing and recognizing complicated objects proves to be a powerful technique. However, a basic requirement for using implicit polynomials for affine invariant recognition is to have an affine invariant fitting algorithm. In this paper, we study the problem of affine invariant fitting of an implicit polynomial to data. Received Ja...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملImproving the stability of algebraic curves for applications
An algebraic curve is defined as the zero set of a polynomial in two variables. Algebraic curves are practical for modeling shapes much more complicated than conics or superquadrics. The main drawback in representing shapes by algebraic curves has been the lack of repeatability in fitting algebraic curves to data. Usually, arguments against using algebraic curves involve references to mathemati...
متن کاملObject Recognition Based on Moment (or Algebraic) Invariants
Toward the development of an object recognition and positioning system, able to deal with arbitrary shaped objects in cluttered environments, we introduce methods for checking the match of two arbitrary curves in 2D or surfaces in 3D, when each of these subobjects (i.e., regions) is in arbitrary position, and we also show how to efficiently compute explicit expressions for the coordinate transf...
متن کاملAn improved algorithm for algebraic curve and surface fitting
Recent years have seen an increasing interest in algebraic curves and surfaces of high degree as geometric models or shape descriptors for model-based computer vision tasks such as object recognition and position estimation. Although their invariant-theoretic properties them a natural choice for these tasks, fitting algebraic curves and surfaces to data sets is difficult, and fitting algorithms...
متن کامل